Automated Generation of Loop Invariants by Recurrence Solving in Theorema ∗ Presented at 6 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC04), Timişoara, Romania
نویسندگان
چکیده
Most of the properties established during program verification are either invariants or depend crucially on invariants. The effectiveness of automated verification of (imperative) programs is therefore sensitive to the ease with which invariants, even trivial ones, can be automatically deduced. We present a method for invariant generation that relies on combinatorial techniques, namely on recurrence solving and variable elimination. We implemented the method within the mathematical assistant Theorema (www.theorema.org) and we demonstrate its effectiveness on several examples.
منابع مشابه
Practical Aspects of Imperative Program Verification in Theorema Presented at 5 International Workshop on Symbolic and Numeric Algorithms for Scientific Computing
Approaching the problem of imperative program verification from a practical point of view has certain implications concerning: the style of specifications, the programming language which is used, the help provided to the user for finding appropriate loop invariants, the theoretical frame used for formal verification, the language used for expressing generated verification theorems as well as th...
متن کاملAutomated Invariant Generation by Algebraic Techniques for Imperative Program Verification in Theorema Automated Invariant Generation by Algebraic Techniques for Imperative Program Verification in Theorema
This thesis presents algebraic and combinatorial approaches for reasoning about imperative loops with assignments, sequencing and conditionals. A certain family of loops, called P-solvable, is defined for which the value of each program variable can be expressed as a polynomial of the initial values of variables, the loop counter, and some new variables where there are algebraic dependencies am...
متن کاملAutomated Generation of Loop Invariants by Recurrence Solving in Theorema
Most of the properties established during program verification are either invariants or depend crucially on invariants. The effectiveness of automated verification of (imperative) programs is therefore sensitive to the ease with which invariants, even trivial ones, can be automatically deduced. We present a method for invariant generation that relies on combinatorial techniques, namely on recur...
متن کاملGeneration of Loop Invariants in Theorema by Combinatorial and Algebraic Methods
When generating verification conditions for a program, one is faced with one major task, namely with the situation when some additional assertions are needed (e.g. loop invariants). These assertions have the property that either they are invariant during execution of the program, or they depend on some other invariant properties. Therefore, automated formal verification is sensitive to the auto...
متن کاملEXPERIMENTING WITH RULE LEARNING FOR INFORMATION EXTRACTION FROM HTML Presented at 6 Int. Symposium SYNASC04, Timişoara, Romania
The Web is a continuously growing information repository with a rich semantic structure that spans many application areas. The Web, however, has been designed primarily for human consumption rather than automated processing. This is a major obstacle for automating tasks like information searching, filtering and extraction. In this context, the aim of the paper is to present a technique for lear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005